Licensing under general demand and cost functions
نویسندگان
چکیده
منابع مشابه
Cost-sharing mechanisms for scheduling under general demand settings
We investigate cost-sharing mechanisms for scheduling cost-sharing games. We assume that the demand is general—that is, each player can be allocated one of several levels of service. We show how to design mechanisms for these games that are weakly group strategyproof, approximately budget-balanced, and approximately efficient, using approximation algorithms for the underlying scheduling problem...
متن کاملGeneral licensing schemes for a cost-reducing innovation
Two general forms of standard licensing policies are considered for a non-drastic cost-reducing innovation: (a) combination of an upfront fee and uniform linear royalty, and (b) combination of auction and uniform linear royalty. It is shown that in an oligopoly, the total reduction in the cost due to the innovation for the pre-innovation competitive output forms the lower bound of the payoffs o...
متن کاملDemand allocation with latency cost functions
We address the exact resolution of a MINLP model where resources can be activated in order to satisfy a demand (a partitioning constraint) while minimizing total cost. Cost functions are convex latency functions plus a fixed activation cost. A branch and bound algorithm is devised, featuring three important characteristics. First, the lower bound (therefore each subproblem) can be computed in O...
متن کاملForcasting under General Loss Functions
This paper presents some results for solving prediction problems under general asymmetric loss functions. We prove existence of the optimal predictor and uniqueness under certain additional assumption fulllled for instance by convex prediction error loss. Furthermore we study the question of niteness of the optimal predictor for prediction error loss with saturation.
متن کاملOnline scheduling with general cost functions
We consider a general online scheduling problem on a single machine with the objective of minimizing ∑ j wjg(Fj), where wj is the weight/importance of job Jj , Fj is the flow time of the job in the schedule, and g is an arbitrary non-decreasing cost function. Numerous natural scheduling objectives are special cases of this general objective. We show that the scheduling algorithm Highest Density...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2016
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2016.01.057